On Orbital Partitions and Exceptionality of Primitive Permutation Groups
نویسندگان
چکیده
Let G and X be transitive permutation groups on a set Ω such that G is a normal subgroup of X. The overgroup X induces a natural action on the set Orbl(G,Ω) of non-trivial orbitals of G on Ω. In the study of Galois groups of exceptional covers of curves, one is led to characterizing the triples (G,X,Ω) where X fixes no elements of Orbl(G,Ω); such triples are called exceptional. In the study of homogeneous factorizations of complete graphs, one is led to characterizing quadruples (G,X,Ω,P) where P is a partition of Orbl(G,Ω) such that X is transitive on P; such a quadruple is called a TOD (transitive orbital decomposition). It follows easily that the triple (G,X,Ω) in a TOD (G,X,Ω,P) is exceptional; conversely if an exceptional triple (G,X,Ω) is such that X/G is cyclic of prime-power order, then there exists a partition P of Orbl(G,Ω) such that (G,X,Ω,P) is a TOD. This paper characterizes TODs (G,X,Ω,P) such that XΩ is primitive and X/G is cyclic of primepower order. An application is given to the classification of self-complementary vertex-transitive graphs.
منابع مشابه
The rational function analogue of a question of Schur and exceptionality of permutation representations
In 1923 Schur considered the following problem. Let f ∈ Z[X] be a polynomial that induces a bijection on the residue fields Z/pZ for infinitely many primes p. His conjecture, that such polynomials are compositions of linear and Dickson polynomials, was proved by M. Fried in 1970. Here we investigate the analogous question for rational functions, and also we allow the base field to be any number...
متن کاملPrimitive permutation groups of bounded orbital diameter
We give a description of infinite families of finite primitive permutation groups for which there is a uniform finite upper bound on the diameter of all orbital graphs. This is equivalent to describing families of finite permutation groups such that every ultraproduct of the family is primitive. A key result is that, in the almost simple case with socle of fixed Lie rank, apart from very specif...
متن کاملAssociation schemes and permutation groups
A set of zero-one matrices satisfying (CC1)–(CC4) is called a coherent configuration. It is really a combinatorial object, since the conditions on the matrices can be translated into combinatorial conditions on the binary relations Oi. The coherent configuration formed by the orbital matrices of a permutation group G is the orbital configuration of G. Indeed, a coherent configuration is a parti...
متن کاملMeasures for the exceptionality of gene order in conserved genomic regions
We propose in this article three measures for quantifying the exceptionality of gene order in conserved genomic regions found by the reference region approach. The three measures are based on the transposition distance in the permutation group. We obtain analytic expressions for their distribution in the case of a random uniform permutation, i.e. under the null hypothesis of random gene order. ...
متن کاملOn the Relational Complexity of a Finite Permutation Group
The relational complexity ρ(X,G) of a finite permutation group is the least k for which the group can be viewed as an automorphism group acting naturally on a homogeneous relational system whose relations are k-ary (an explicit permutation group theoretic version of this definition is also given). In the context of primitive permutation groups, the natural questions are (a) rough estimates, or ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004